Tenth Spectral Moment for Molecular Graphs of Phenylenes
نویسنده
چکیده
Our investigations are motivated by recent papers concerning the spectral moments of the edge-adjacency matrix, which were successfully employed in QSAR and QSPR studies of different classes of compounds [Estrada, E. J. Chem. Inf. Comput. Sci. 1996, 36, 844-849; 1997, 37, 320-328; 1998, 38, 23-27]. In this work, the evaluation of the 10th spectral moment of the vertex-adjacency matrix for phenylenes is considered. This is achieved by using the method of Hall [Hall, G. G. Theor. Chim. Acta 1986, 70, 323-332], which was originally applied to benzenoid systems and then adopted for molecular graphs of phenylenes [Marković, S.; Stajković, A. Theor. Chem. Acc. 1997, 96, 256-260]. It is found that the 10th spectral moment can be expressed in terms of 6 mutually independent invariants that can be easily deduced from the molecular graph.
منابع مشابه
Spectral Moments of Phenylenes
In a series of publications Estrada (Estrada, E. J. Chem. Inf. Comput. Sci. 1996, 36, 844-849; 1997 37, 320-328; 1998, 38, 23-27) employed spectral moments of line graphs in QSPR and QSAR relationship studies of various classes of compounds. A recent paper (Marković, S.; Gutman, I. J. Chem. Inf Comput. Sci. 1999, 39, 289-293) reported that in QSPR and QSAR investigations of benzenoid hydrocarbo...
متن کاملApproximating total 1t-electron energy of phenylenes in terms of spectral moments
The total n-electron energy of phenylenes is approximated by means of a linear combination of the fi rst few spectral moments of both molecular and line graphs. The two sets of moments produce very similar results, with very high accuracy. It is found that over 99.8% of the HMO totaln-electron energy of phenylenes is determined by the number of carbon atoms. Number of bay regions plays a signif...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملUse of Structure Codes (Counts) for Computing Topological Indices of Carbon Nanotubes: Sadhana (Sd) Index of Phenylenes and its Hexagonal Squeezes
Structural codes vis-a-vis structural counts, like polynomials of a molecular graph, are important in computing graph-theoretical descriptors which are commonly known as topological indices. These indices are most important for characterizing carbon nanotubes (CNTs). In this paper we have computed Sadhana index (Sd) for phenylenes and their hexagonal squeezes using structural codes (counts). Sa...
متن کاملComputing distance moments on graphs with transitive Djoković-Winkler relation
The cut method proved to be utmost useful to obtain fast algorithms and closed formulas for classical distance based invariants of graphs isometrically embeddable into hypercubes. These graphs are known as partial cubes and in particular contain numerous chemically important graphs such as trees, benzenoid graphs, and phenylenes. It is proved that the cut method can be used to compute an arbitr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Chemical Information and Computer Sciences
دوره 39 شماره
صفحات -
تاریخ انتشار 1999